Boolean Algebras, Tarski Invariants, and Index Sets

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Boolean Algebras, Tarski Invariants, and Index Sets

Tarski defined a way of assigning to each boolean algebra, B, an invariant inv(B) ∈ In, where In is a set of triples from N, such that two boolean algebras have the same invariant if and only if they are elementarily equivalent. Moreover, given the invariant of a boolean algebra, there is a computable procedure that decides its elementary theory. If we restrict our attention to dense Boolean al...

متن کامل

Invariants , Boolean Algebras and Aca

The sentences asserting the existence of invariants for mathematical structures are usually third order ones. We develop a general approach to analyzing the strength of such statements in second order arithmetic in the spirit of reverse mathematics. We discuss a number of simple examples that are equivalent to ACA0. Our major results are that the existence of elementary equivalence invariants f...

متن کامل

Invariants , Boolean Algebras and Aca + 0

The sentences asserting the existence of invariants for mathematical structures are usually third order ones. We develop a general approach to analyzing the strength of such statements in second order arithmetic in the spirit of reverse mathematics. We discuss a number of simple examples that are equivalent to ACA0. Our major results are that the existence of elementary equivalence invariants f...

متن کامل

Invariants , Boolean Algebras and Aca + 0 Richard

The sentences asserting the existence of invariants for mathematical structures are usually third order ones. We develop a general approach to analyzing the strength of such statements in second order arithmetic in the spirit of reverse mathematics. We discuss a number of simple examples that are equivalent to ACA0. Our major results are that the existence of elementary equivalence invariants f...

متن کامل

Irredundant Sets in Boolean Algebras

It is shown that every uncountable Boolean algebra A contains an uncountable subset / such that no a of / is in the subalgebra generated by I\{a} using an additional axiom of set theory. It is also shown that a use of some such axiom is necessary. A subset / of a Boolean algebra A is irredundant if no proper subset of / generates the same subalgebra as /, or equivalently, if no a of / is in the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Notre Dame Journal of Formal Logic

سال: 2006

ISSN: 0029-4527

DOI: 10.1305/ndjfl/1143468308